Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup

摘要

Every semigroup which is a finite disjoint union of copies of the free mono-genic semigroup (natural numbers under addition) has soluble word prob- lem andsoluble membership problem. Efficient algorithms are given for both problems.